An Improved Authenticated Encryption Scheme
نویسندگان
چکیده
منابع مشابه
Convertible authenticated encryption scheme
The digital signature provides the functions of integration, authentication, and non-repudiation for the signing message. In some applications, however, the signature only needs to be verified by some specified recipients while keeping the message secret from the public. The authenticated encryption schemes can be used to achieve this purpose. To protect the recipient’s benefit in the case of a...
متن کاملImproved convertible authenticated encryption scheme with provable security
Article history: Received 26 August 2010 Received in revised form 22 November 2010 Accepted 25 March 2011 Available online 14 April 2011 Communicated by L. Viganò
متن کاملAn Enhanced Threshold Authenticated Encryption Scheme with Convertibility
Recently, Chung et al. (2009) proposed a novel and valuable threshold authenticated encryption scheme. Unfortunately, it has a potential weakness: if the secret message involves criminal evidence or illegal content, the designated receiver cannot authenticate the secret message in the later dispute. The authors of this paper aim at enhancing Chung et al.’s scheme by adding the convertibility ca...
متن کاملImprovement on a Threshold Authenticated Encryption Scheme
The authenticated encryption scheme allows one signer to generate an authenticated cipher-text so that no one except the designated verifier can recover the message and verify the message. In a (t, n) threshold authenticated encryption scheme, any t or more signers can generate an authenticated encryption for a message and send it to the designated verifier. Compared with the conventional encry...
متن کاملCryptanalysis of the OKH Authenticated Encryption Scheme
Alomair proposed a new authenticated encryption scheme OKH at ACNS 2012, and proved the security, i.e. authenticity and privacy, of OKH. Our research shows that it is not the case. We only need one query to break the authenticity of OKH with success probability of 1, and two queries to break the privacy of OKH with success probability of 1− 1/2, where n is the block-length of underlying blockci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2011
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e94.d.2171